MOSEL: A FLexible Toolset for Monadic Second-Order Logic
نویسندگان
چکیده
Mosel is a new tool-set for the analysis and veri cation in Monadic Second-order Logic. In this paper we concentrate on the system's design: Mosel is a tool-set to include a exible set of decision procedures for several theories of the logic complemented by a variety of support components for input format translations, visualization, and interfaces to other logics and tools. The main distinguishing features of Mosel are its layered approach to the logic, based on a formal semantics for a minimal subset, its modular design, and its integration in a heterogeneous analysis and veri cation environment.
منابع مشابه
Mosel: a Sound and Eecient Toolfor M2l(str)
Mosel [6] is a new system for the analysis and veri cation in Monadic SecondOrder Logic (M2L) based on model construction. The aim is to o er a systemlevel environment supporting several theories of the logic. Mosel is a toolset, which, in its complete realization, will include a exible set of decision procedures for several theories of the logic (e.g., nite and in nite strings, and trees) comp...
متن کاملOn Cloning Context-Freeness
A first-order language is called monadic if its non-logical vocabulary lacks both function symbols and relation symbols of arity greater than one. Formulas of this kind of language can be mechanically tested for validity but its expressive power seems to be too restricted to be of any interest for linguistics. Monadic second-order languages on the other hand extend the language of (full) first-...
متن کاملjMosel: A Flexible Tool-Set for Monadic Second-Order Logic on Strings
jMosel is a tool-set for the analysis and verification of linear parametric systems in monadic second-order logic on strings. In this paper we concentrate on the presentation of the core tool which supports several input and output formats as well as the interchange of the tool-set’s internal components. The main design principles of jMosel are its layered approach to the logic, the definition ...
متن کاملLimited Set quantifiers over Countable Linear Orderings
In this paper, we study several sublogics of monadic secondorder logic over countable linear orderings, such as first-order logic, firstorder logic on cuts, weak monadic second-order logic, weak monadic second-order logic with cuts, as well as fragments of monadic secondorder logic in which sets have to be well ordered or scattered. We give decidable algebraic characterizations of all these log...
متن کاملExpressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees
We study an extension of monadic second-order logic of order with the uncountability quantifier “there exist uncountably many sets”. We prove that, over the class of finitely branching trees, this extension is equally expressive to plain monadic second-order logic of order. Additionally we find that the continuum hypothesis holds for classes of sets definable in monadic second-order logic over ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997